Volumes of 3D Drawings of Homogenous Product Graphs
نویسنده
چکیده
3-dimensional layout of graphs is a standard model for orthogonal graph drawing. Vertices are mapped into the 3D grid and edges are drawn as the grid edge disjoint paths. The main measure of the efficiency of the drawing is the volume which is motivated by the 3D VLSI design. In this paper we develop a general framework for efficient 3D drawing of product graphs in both 1 active layer and general model. As a consequence we obtain several optimal drawings of product graphs when the factor graphs represent typical networks like CCC, Butterfly, star graph, De Bruijn... This is an analogue of a similar work done by Fernandez and Efe [6] for 2D drawings using a different approach.
منابع مشابه
A Genetic Algorithm based Optimization Method in 3D Solid Reconstruction from 2D Multi-View Engineering Drawings
There are mainly two categories for a 3D reconstruction from 2D drawings: B-Rep and CSG that both these methods have serious weaknesses despite being useful. B-Rep method which has been older and have wider function range is problematic because of high volume of calculations and vagueness in answers and CSG method has problem in terms of very limited range of volumes and drawings that it can an...
متن کاملComputing straight-line 3D grid drawings of graphs in linear volume
This paper investigates the basic problem of computing crossing-free straight-line 3D grid drawings of graphs such that the overall volume is small. Motivated by their relevance in the literature, we focus on families of graphs having constant queue number and on k-trees. We present algorithms that compute drawings of these families of graphs on 3D grids consisting of a constant number of paral...
متن کاملStraight - Line Drawings on Restricted
This paper investigates the following question: Given an integer grid , where is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit straight-line crossing-free drawings with vertices located at the grid points of ? We characterize the trees that can be drawn on a two dimensional c n k grid, where k and c are given integer constants, and on a two ...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملGraph product of generalized Cayley graphs over polygroups
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005